Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
301	Computing Science TACKLING THE PARTNER UNITS CONFIGURATION PROBLEM Markus Aschinger, Conrad Drescher, Gerhard Friedrich, Georg Gottlob, Peter Jeavons, Anna Ryabokon, Evgenij Thorstensen Add to Reading List Source URL: www.cs.ox.ac.uk Language: English - Date: 2013-06-06 21:32:58 Induced path Graph Matroid theory Graph coloring NP-complete problems Pseudoforest Graph theory Graph operations Path decomposition
302	Introduction Power Domination Network and Attack Models Structural Controllability under Vertex Removal Conclusions and Future Work Add to Reading List Source URL: www.critis2013.nl Language: English - Date: 2013-09-21 17:44:33 Control theory Graph theory NP-complete problems Controllability Dominating set Vertex Graph Network theory Network controllability Mathematics Theoretical computer science Applied mathematics
303	cccg-cluster_visibility-2.dvi Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:19 NP-complete problems Art gallery problem Steiner tree problem Vertex Connectivity Pseudotriangle Tree Graph Dominating set Graph theory Mathematics Theoretical computer science
304	The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number ? Michael Fellows1,2 and Frances Rosamond1 Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:12:58 NP-complete problems Analysis of algorithms Parameterized complexity Kernelization Bidimensionality Dominating set Tree decomposition Path decomposition Feedback vertex set Theoretical computer science Computational complexity theory Graph theory
305	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 On Rolling Cube Puzzles Kevin Buchin∗ Maike Buchin∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:27:49 Graph Path Graph operations Implicit graph Line graph Graph theory NP-complete problems Hamiltonian path
306	Research Statement Darren Strash Institute of Theoretical Informatics Karlsruhe Institute of Technology January 12, 2015 Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2015-01-12 15:52:14 NP-complete problems Algorithm Mathematical logic Graph theory Computational geometry Graph coloring Combinatorics Distributed computing Kurt Mehlhorn Theoretical computer science Mathematics Applied mathematics
307	CCCG 2011, Toronto ON, August 10–12, 2011 Euclidean Movement Minimization Nima Anari∗ MohammadAmin Fazli† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:16 NP-complete problems Hamiltonian path Vertex cover Independent set Matching Minimum spanning tree Dominating set Graph coloring Theoretical computer science Graph theory Mathematics
308	Position-Based Routing on 3-D Geometric Graphs in Mobile Ad Hoc Networks George Kao∗ Thomas Fevens∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-07-31 13:55:53 Routing algorithms Wireless networking Routing protocols Network theory NP-complete problems Geographic routing Routing Unit disk graph Shortest path problem Graph theory Theoretical computer science Mathematics
309	CCCG 2006, Kingston, Ontario, August 14–16, 2006 Hamiltonian Cycles in Triangular Grids Valentin Polishchuk∗ Esther M. Arkin† Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-27 22:57:41 Induced path Cycle graph Planar graph Path Petersen graph Panconnectivity Graph theory NP-complete problems Hamiltonian path
310	CCCG 2011, Toronto ON, August 10–12, 2011 Bottleneck Steiner Tree with Bounded Number of Steiner Vertices A. Karim Abu-Affash∗ Paz Carmi† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-15 18:22:15 NP-complete problems Spanning tree Steiner tree problem NP-hard problems Minimum spanning tree Tree Vertex cover Rectilinear Steiner tree Connectivity Graph theory Theoretical computer science Mathematics

UPDATE